Abstract categorical semantics for resourceful functional reactive programming

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a Common Categorical Semantics for Linear-Time Temporal Logic and Functional Reactive Programming

Linear-time temporal logic (LTL) and functional reactive programming (FRP) are related via a Curry–Howard correspondence. Based on this observation, we develop a common categorical semantics for a subset of LTL and its corresponding flavor of FRP. We devise a class of categorical models, called fan categories, that explicitly reflect the notion of time-dependent trueness of temporal proposition...

متن کامل

Categorical Semantics for Functional Reactive Programming with Temporal Recursion and Corecursion

process categories (APCs) are axiomatically defined categorical models of FRP with processes, which we developed recently [7]. They are an extension of temporal categories, which are models of FRP with behaviors and events, but without processes [5]. In this section, we give an introduction to APCs. 3.1 The Basics An APC is a category C with some additional structure. FRP types are modeled by o...

متن کامل

Categorical Semantics for Array Programming Languages

Background Consider the usual addition operator between (real or complex) numbers: a, b 7→ a + b This can be straightforwardly extended to give an additive structure on R for any n ∈ N: (a1, . . . , an) + (b1, . . . , bn) := (a1 + b1, . . . , an + bn) Similarly, we can extend our notion of addition to give a canonical way of adding arrays of any shape: (aijk...z) + (bijk...z) := (aijk...z + bij...

متن کامل

Categorical semantics of programming languages (in COQ)

Formalized mathematics have met an increasing interest in the last years. They give a way to build digital searchable libraries of mathematics, and computerverified proofs allow for a level of trust in the theory which the pen and paper versions cannot supply. Our first goal is to build a library of category theory [2] in the proof assistent COQ [1]. A comprehensive library surely demands more ...

متن کامل

Parallel Functional Reactive Programming

In this paper, we demonstrate how Functional Reactive Programming (FRP), a framework for the description of interactive systems, can be extended to encompass parallel systems. FRP is based on Haskell, a purely functional programming language, and incorporates the concepts of time variation and reactivity. Parallel FRP serves as a declarative system model that may be transformed into a parallel ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming

سال: 2016

ISSN: 2352-2208

DOI: 10.1016/j.jlamp.2016.07.001